The time to read the input and initialise the problem = 406 ms
The time to create the optimal problem = 0 ms
The time to compute the optimal solution = 141 ms
The optimal solution is:
x11=0.000000
x12=1.000000
x13=0.000000
x14=0.000000
x15=0.000000
x21=0.000000
x22=0.000000
x23=0.000000
x24=1.000000
x25=0.000000
x31=0.000000
x32=1.000000
x33=0.000000
x34=0.000000
x35=0.000000
x41=0.750000
x42=0.000000
x43=0.250000
x44=0.000000
x45=0.000000
x51=0.000000
x52=0.000000
x53=0.000000
x54=1.000000
x55=0.000000
x61=0.000000
x62=0.000000
x63=0.904762
x64=0.095238
x65=0.000000
x71=0.000000
x72=0.000000
x73=0.000000
x74=1.000000
x75=0.000000
x81=0.000000
x82=0.000000
x83=0.000000
x84=1.000000
x85=0.000000
x91=0.000000
x92=0.850000
x93=0.150000
x94=0.000000
x95=0.000000
x101=0.000000
x102=1.000000
x103=0.000000
x104=0.000000
x105=0.000000
y1=1
y2=1
y3=1
y4=1
y5=0
z1=1
z2=1
z3=1
w11=0.000000
w12=0.000000
w13=24.000000
w14=83.000000
w15=0.000000
w21=6.000000
w22=0.000000
w23=0.000000
w24=0.000000
w25=0.000000
w31=0.000000
w32=69.000000
w33=0.000000
w34=0.000000
w35=0.000000
z=55152.861905
The time to read the optimal solution = 0 ms
Run time is 1547 ms
